Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
📈 Linear programming
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
24789
posts in
25.7
ms
Simplex
Algorithm
🕸️
Graph Algorithms
en.wikipedia.org
·
2d
·
Hacker News
Allocation
with
Substitutes
🎯
Arithmetic Coding Theory
jslandy.com
·
6d
·
Hacker News
On the Complexity of
Discounted
Robust
MDPs
with $L_p$ Uncertainty Sets
🧮
Kolmogorov Bounds
arxiv.org
·
4h
Think
Linear
Algebra
📐
Linear Algebra
allendowney.github.io
·
1d
·
Hacker News
Minimizing
and Finding
Satisifaction
with Less
⬜
Minimalism
chuck.is
·
4d
·
Hacker News
Convex Optimization with
Nested
Evolving
Feasible
Sets
⚡
Incremental Computation
arxiv.org
·
1d
EPTAS
for Hard Graph Cut Problems for
Dense
Graphs
🎨
Graph Coloring
arxiv.org
·
1d
Fair
Interval
Scheduling of
Indivisible
Chores
🎨
Graph Coloring
arxiv.org
·
6d
Sample Complexity of Stochastic Optimization with
Integer
Variables
🧮
Kolmogorov Complexity
arxiv.org
·
1d
Deterministic
Mincut
in Almost-Linear Time
📼
Tape Combinators
arxiv.org
·
5d
Instance and
Universally
Optimal Bounds for
Imprecise
Pareto Fronts
🧮
Kolmogorov Bounds
arxiv.org
·
1d
From
Feasible
to Practical:
Pareto-Optimal
Synthesis Planning
⚙️
Logic Synthesis
arxiv.org
·
1d
One-Dimensional
Nonnegative
Spline
Smoothing via Convex Semi-Infinite Programming with a Cutting-Plane Method
📐
Linear Algebra
arxiv.org
·
6d
Penalty-Based First-Order Methods for
Bilevel
Optimization with
Minimax
and Constrained Lower-Level Problems
🧮
Kolmogorov Bounds
arxiv.org
·
1d
Solving Max-Cut to Global
Optimality
via
Feasibility-Preserving
Graph Neural Networks
🧠
Machine Learning
arxiv.org
·
1d
Hardness
of some optimization problems over correlation
polyhedra
🎯
Performance Proofs
arxiv.org
·
6d
On the Complexity of Minimum
Riesz
s-Energy Subset Selection in Euclidean and
Ultrametric
Spaces
🧮
Kolmogorov Complexity
arxiv.org
·
5d
Optimal Union Probability
Interval
Is
NP-Hard
🧮
Kolmogorov Bounds
arxiv.org
·
6d
Submodular
Ground-Set Pruning: Monotone
Tightness
and a Non-Monotone Separation
🧮
Kolmogorov Bounds
arxiv.org
·
5d
S-LCG
: Structured Linear
Congruential
Generator-Based Deterministic Algorithm for Search and Optimization
👑
Coq Tactics
arxiv.org
·
5d
Page 2 »
Log in to enable infinite scrolling
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help